منابع مشابه
Private vs. Common Random Bits in Communication Complexity
We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the two model are essentially equal. Communication complexity is a model of computation where two parties, each with an input, want to mutually compute a Boolean function that is deened on pairs of inputs. Formally, let f : X Y 7 ! f0; 1g be a Boolean...
متن کاملMeasurements vs. Bits: Compressed Sensing meets Information Theory
Compressed sensing is a new framework for acquiring sparse signals based on the revelation that a small number of linear projections (measurements) of the signal contain enough information for its reconstruction. The foundation of Compressed sensing is built on the availability of noise-free measurements. However, measurement noise is unavoidable in analog systems and must be accounted for. We ...
متن کاملBits and q-bits as versatility measures.
Using Shannon information theory is a common strategy to measure any kind of variability in a signal or phenomenon. Some methods were developed to adapt information entropy measures to bird song data trying to emphasize its versatility aspect. This classical approach, using the concept of bit, produces interesting results. Now, the original idea developed in this paper is to use the quantum inf...
متن کاملShaping Bits
The performance of bit-interleaved coded modulation (BICM) with bit shaping (i.e., non-equiprobable bit probabilities in the underlying binary code) is studied. For the Gaussian channel, the rates achievable with BICM and bit shaping are practically identical to those of coded modulation or multilevel coding. This identity holds for the whole range of values of signalto-noise ratio. Moreover, t...
متن کاملSuper-bits, Demi-bits, and NP/qpoly-natural Proofs
We introduce the super-bit conjecture, which allows the development of a theory generalizing the notion of pseudorandomness so as to fool non-deterministic statistical tests. This new kind of pseudorandomness rules out the existence of N P=poly-natural properties that can work against P=poly. This is an important extension of the original theory of P=poly-natural proofs 10]. We also introduce t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Consumer Electronics Magazine
سال: 2019
ISSN: 2162-2248,2162-2256
DOI: 10.1109/mce.2019.2923931